在迅速增长的海上风电场市场中出现了增加风力涡轮机尺寸和距离的全球趋势。在英国，海上风电业于2019年生产了英国最多的电力，前一年增加了19.6％。目前，英国将进一步增加产量，旨在增加安装的涡轮机容量74.7％，如最近的冠村租赁轮次反映。通过如此巨大的增长，该部门现在正在寻求机器人和人工智能（RAI），以解决生命周期服务障碍，以支持可持续和有利可图的海上风能生产。如今，RAI应用主要用于支持运营和维护的短期目标。然而，前进，RAI在海上风基础设施的全部生命周期中有可能发挥关键作用，从测量，规划，设计，物流，运营支持，培训和退役。本文介绍了离岸可再生能源部门的RAI的第一个系统评论之一。在当前和未来的要求方面，在行业和学术界的离岸能源需求分析了rai的最先进的。我们的评论还包括对支持RAI的投资，监管和技能开发的详细评估。通过专利和学术出版数据库进行详细分析确定的关键趋势，提供了对安全合规性和可靠性的自主平台认证等障碍的见解，这是自主车队中可扩展性的数字架构，适应性居民运营和优化的适应性规划人机互动对人与自治助理的信赖伙伴关系。

Continuous long-term monitoring of motor health is crucial for the early detection of abnormalities such as bearing faults (up to 51% of motor failures are attributed to bearing faults). Despite numerous methodologies proposed for bearing fault detection, most of them require normal (healthy) and abnormal (faulty) data for training. Even with the recent deep learning (DL) methodologies trained on the labeled data from the same machine, the classification accuracy significantly deteriorates when one or few conditions are altered. Furthermore, their performance suffers significantly or may entirely fail when they are tested on another machine with entirely different healthy and faulty signal patterns. To address this need, in this pilot study, we propose a zero-shot bearing fault detection method that can detect any fault on a new (target) machine regardless of the working conditions, sensor parameters, or fault characteristics. To accomplish this objective, a 1D Operational Generative Adversarial Network (Op-GAN) first characterizes the transition between normal and fault vibration signals of (a) source machine(s) under various conditions, sensor parameters, and fault types. Then for a target machine, the potential faulty signals can be generated, and over its actual healthy and synthesized faulty signals, a compact, and lightweight 1D Self-ONN fault detector can then be trained to detect the real faulty condition in real time whenever it occurs. To validate the proposed approach, a new benchmark dataset is created using two different motors working under different conditions and sensor locations. Experimental results demonstrate that this novel approach can accurately detect any bearing fault achieving an average recall rate of around 89% and 95% on two target machines regardless of its type, severity, and location.

The increase in the number of unmanned aerial vehicles a.k.a. drones pose several threats to public privacy, critical infrastructure and cyber security. Hence, detecting unauthorized drones is a significant problem which received attention in the last few years. In this paper, we present our experimental work on three drone detection methods (i.e., acoustic detection, radio frequency (RF) detection, and visual detection) to evaluate their efficacy in both indoor and outdoor environments. Owing to the limitations of these schemes, we present a novel encryption-based drone detection scheme that uses a two-stage verification of the drone's received signal strength indicator (RSSI) and the encryption key generated from the drone's position coordinates to reliably detect an unauthorized drone in the presence of authorized drones.

Data-driven modeling approaches such as jump tables are promising techniques to model populations of resistive random-access memory (ReRAM) or other emerging memory devices for hardware neural network simulations. As these tables rely on data interpolation, this work explores the open questions about their fidelity in relation to the stochastic device behavior they model. We study how various jump table device models impact the attained network performance estimates, a concept we define as modeling bias. Two methods of jump table device modeling, binning and Optuna-optimized binning, are explored using synthetic data with known distributions for benchmarking purposes, as well as experimental data obtained from TiOx ReRAM devices. Results on a multi-layer perceptron trained on MNIST show that device models based on binning can behave unpredictably particularly at low number of points in the device dataset, sometimes over-promising, sometimes under-promising target network accuracy. This paper also proposes device level metrics that indicate similar trends with the modeling bias metric at the network level. The proposed approach opens the possibility for future investigations into statistical device models with better performance, as well as experimentally verified modeling bias in different in-memory computing and neural network architectures.

Federated Learning (FL) is a machine learning paradigm that enables the training of a shared global model across distributed clients while keeping the training data local. While most prior work on designing systems for FL has focused on using stateful always running components, recent work has shown that components in an FL system can greatly benefit from the usage of serverless computing and Function-as-a-Service technologies. To this end, distributed training of models with severless FL systems can be more resource-efficient and cheaper than conventional FL systems. However, serverless FL systems still suffer from the presence of stragglers, i.e., slow clients due to their resource and statistical heterogeneity. While several strategies have been proposed for mitigating stragglers in FL, most methodologies do not account for the particular characteristics of serverless environments, i.e., cold-starts, performance variations, and the ephemeral stateless nature of the function instances. Towards this, we propose FedLesScan, a novel clustering-based semi-asynchronous training strategy, specifically tailored for serverless FL. FedLesScan dynamically adapts to the behaviour of clients and minimizes the effect of stragglers on the overall system. We implement our strategy by extending an open-source serverless FL system called FedLess. Moreover, we comprehensively evaluate our strategy using the 2nd generation Google Cloud Functions with four datasets and varying percentages of stragglers. Results from our experiments show that compared to other approaches FedLesScan reduces training time and cost by an average of 8% and 20% respectively while utilizing clients better with an average increase in the effective update ratio of 17.75%.

In this paper, we address the stochastic contextual linear bandit problem, where a decision maker is provided a context (a random set of actions drawn from a distribution). The expected reward of each action is specified by the inner product of the action and an unknown parameter. The goal is to design an algorithm that learns to play as close as possible to the unknown optimal policy after a number of action plays. This problem is considered more challenging than the linear bandit problem, which can be viewed as a contextual bandit problem with a \emph{fixed} context. Surprisingly, in this paper, we show that the stochastic contextual problem can be solved as if it is a linear bandit problem. In particular, we establish a novel reduction framework that converts every stochastic contextual linear bandit instance to a linear bandit instance, when the context distribution is known. When the context distribution is unknown, we establish an algorithm that reduces the stochastic contextual instance to a sequence of linear bandit instances with small misspecifications and achieves nearly the same worst-case regret bound as the algorithm that solves the misspecified linear bandit instances. As a consequence, our results imply a $O(d\sqrt{T\log T})$ high-probability regret bound for contextual linear bandits, making progress in resolving an open problem in (Li et al., 2019), (Li et al., 2021). Our reduction framework opens up a new way to approach stochastic contextual linear bandit problems, and enables improved regret bounds in a number of instances including the batch setting, contextual bandits with misspecifications, contextual bandits with sparse unknown parameters, and contextual bandits with adversarial corruption.

Cement is the most used construction material. The performance of cement hydrate depends on the constituent phases, viz. alite, belite, aluminate, and ferrites present in the cement clinker, both qualitatively and quantitatively. Traditionally, clinker phases are analyzed from optical images relying on a domain expert and simple image processing techniques. However, the non-uniformity of the images, variations in the geometry and size of the phases, and variabilities in the experimental approaches and imaging methods make it challenging to obtain the phases. Here, we present a machine learning (ML) approach to detect clinker microstructure phases automatically. To this extent, we create the first annotated dataset of cement clinker by segmenting alite and belite particles. Further, we use supervised ML methods to train models for identifying alite and belite regions. Specifically, we finetune the image detection and segmentation model Detectron-2 on the cement microstructure to develop a model for detecting the cement phases, namely, Cementron. We demonstrate that Cementron, trained only on literature data, works remarkably well on new images obtained from our experiments, demonstrating its generalizability. We make Cementron available for public use.

历史上，内容一直是用于研究在线社区语言的主要镜头。相反，本文重点介绍了社区的语言风格。虽然我们知道个人具有可区分的风格，但我们在这里询问社区是否具有可区分的风格。此外，尽管先前的工作依赖于风格的狭义定义，但我们采用了一个广泛的定义，涉及262个功能来分析来自3个社交媒体平台的9个在线社区的语言风格，讨论政治，电视和旅行。我们发现社区确实具有不同的风格。此外，样式是小组成员资格的出色预测指标（F-评分0.952和准确性96.09％）。虽然平均而言，它在统计学上等同于仅使用内容的预测，但它对于减少培训数据的弹性更具弹性。

人们认识到，感官感知和语言通过心理学，神经科学和感官语言学的众多研究具有互连。在这种丰富的背景下，我们询问在著作中使用感官语言是否是语言风格的一部分？从样式计量学研究的角度来看，这个问题很重要，在该研究中，已经探索了丰富的语言功能，但对与感觉语言相关的功能的关注不足。以此为目标，我们探索了关于歌词，小说和诗歌集合中的感官语言和风格的几个角度。例如，我们发现个人使用感官语言不是一种随机现象。选择可能涉及。同样，感官风格通常会随着时间的推移而稳定 - 转移非常小。此外，只需从具有感官术语的几百个句子中提取样式。我们还确定每种类型中的代表性和独特特征。例如，我们观察到，小说收集的前6个代表性特征中有4个涉及使用嗅觉语言的个人，我们希望他们使用非富特语言。

网络嵌入任务是将网络中的节点表示为低维矢量，同时结合了拓扑和结构信息。大多数现有方法通过直接或隐式分配接近性矩阵来解决此问题。在这项工作中，我们从新的角度介绍了一种网络嵌入方法，该方法利用现代Hopfield网络（MHN）进行关联学习。我们的网络学习每个节点的内容与该节点的邻居之间的关联。这些关联是MHN中的回忆。鉴于该节点的邻居，网络的复发动力学使得可以恢复蒙版节点。我们提出的方法对不同的下游任务进行评估，例如节点分类和链接预测。与常见的矩阵分解技术和基于深度学习的方法相比，结果表明竞争性能。